Blue-Noise Remeshing with Farthest Point Optimization
نویسندگان
چکیده
In this paper, we present a novel method for surface sampling and remeshing with good blue-noise properties. Our approach is based on the farthest point optimization (FPO), a relaxation technique that generates high quality blue-noise point sets in 2D. We propose two important generalizations of the original FPO framework: adaptive sampling and sampling on surfaces. A simple and efficient algorithm for accelerating the FPO framework is also proposed. Experimental results show that the generalized FPO generates point sets with excellent blue-noise properties for adaptive and surface sampling. Furthermore, we demonstrate that our remeshing quality is superior to the current state-of-the-art approaches.
منابع مشابه
Parallel Blue-noise Sampling by Constrained Farthest Point Optimization
We describe a fast sampling algorithm for generating uniformly-distributed point patterns with good blue noise characteristics. The method, based on constrained farthest point optimization, is provably optimal and may be easily parallelized, resulting in an algorithm whose performance/quality tradeoff is superior to other state-of-theart approaches.
متن کاملBlue noise sampling of surfaces
We present an algorithm to generate point distributions with high-quality blue noise characteristics on discrete surfaces. It is based on the concept of Capacity-Constrained Surface Triangulation (CCST), which approximates the underlying continuous surface as a well-formed triangle mesh with uniform triangle areas. The algorithm takes a triangle mesh and the number of sample points as input, an...
متن کاملGeodesic Computation for Adaptive Remeshing
This video presents an application of geodesic computation on 3D meshes to surface remeshing. The farthest point paradigm [1] is a powerful greedy algorithm that allows fast and accurate sampling of the underlying surface. The use of a varying speed function for front propagation enables an adaptive placement of the seed points. The connectivity of the resulting mesh is computed using a geodesi...
متن کاملSpoke Darts for Efficient High Dimensional Blue Noise Sampling
Blue noise refers to sample distributions that are random and wellspaced, with a variety of applications in graphics, geometry, and optimization. However, prior blue noise sampling algorithms typically suffer from the curse-of-dimensionality, especially when striving to cover a domain maximally. This hampers their applicability for high dimensional domains. We present a blue noise sampling meth...
متن کاملHigher dimensional blue-noise sampling schemes for curvelet-based seismic data recovery
In combination with compressive sensing, a successful reconstruction scheme called Curvelet-based Recovery by Sparsitypromoting Inversion (CRSI) has been developed, and has proven to be useful for seismic data processing. One of the most important issues for CRSI is the sampling scheme, which can greatly affect the quality of reconstruction. Unlike usual regular undersampling, stochastic sampli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 33 شماره
صفحات -
تاریخ انتشار 2014